#include <iostream>
#include<vector>
#include<cmath>

using namespace std;

bool isPrime(int num)
{
    for (int i = 2; i < sqrt(num); i += 2)
    {
        if (num % i == 0) return false;
    }
    return true;
}

vector<int> prime;
vector<bool> num(1000000, true);
vector<int> nums;

int main()
{
    for (int i = 2; i < 1000000; i++)
    {
        if (num[i])
        {
            if (isPrime(i))
            {
                prime.push_back(i);
            }
            for (int j = i * 2; j < 1000000; j += i)
            {
                num[j] = false;
            }
        }
    }
    int input = 0;
    while (cin >> input)
    {
        nums.push_back(input);
    }
    for (auto input : nums)
    {
        if (isPrime(input))
        {
            cout << input << '=' << 1 << '*' << input << endl;
            continue;
        }
        cout << input << '=';
        for (auto e : prime)
        {
            while (input && input % e == 0)
            {
                if (input == e)
                {
                    cout << e << endl;
                    goto a;
                }
                else
                {
                    cout << e << '*';
                }
                input /= e;
            }
        }
    a:;
    }
}